Game Semantics & Abstract Machines
نویسندگان
چکیده
The inreraciioii processes at work iii Hylund arid Oizg (HO) urid Abrniiisky, .laguciee.snii uiidMulmaria (A.JM) new game seninritics are two preexisting pavadiginatic iiiipleriieriiafioiis ojlinear head reduction: re~I7ecfively Kriviiie’s RDsfrucr Machine and Girard4 Interactiori Abstract Mncli he. There is U simple oizd tiuirrral embedding ojA.lM-ganzes to MI-ganies, mappirig sirategies to srralegies and reducing A.lM dejiiiuhility (or JiiIl alntractioii) property lo H O 1s one.
منابع مشابه
Estimation of the Length of Interactions in Arena Game Semantics
We estimate the maximal length of interactions between strategies in HO/N game semantics, in the spirit of the work by Schwichtenberg and Beckmann for the length of reduction in simply typed λ-calculus. Because of the operational content of game semantics, the bounds presented here also apply to head linear reduction on λ-terms and to the execution of programs by abstract machines (PAM/KAM), in...
متن کاملToken Machines for Multiport Interaction Combinators
Game semantics [7, 1] and the Geometry of Interaction [6] are semantic frameworks centered around the dynamic, interactive behaviour of the interpreted object rather than on its static, extensional properties. The obtained semantics is often fully abstract, and its concreteness can be exploited in the definition of compilation schemes towards low-level languages, like in the Geometry of Synthes...
متن کاملCompilation using abstract machines for game semantics
One benefit of the invention of programming languages is that the same program can be compiled to and run on multiple platforms without having to be rewritten. If a compiler writer constructs a back-end for a new platform all the programs written in the language can be recompiled and reused on it. In the best case this can be done without having to change the source code at all. The burden of h...
متن کاملA Sound and Complete SOS-Semantics for Non-Distributed Deterministic Abstract State Machines
In this paper we present a sound and complete Structural Operational Semantics (SOS) for non-distributed deterministic Abstract State Machines (ASMs). Since ASMs exhibit both sequential and parallel features, the semantics is structured into two layers. One layer describes the parallel execution of updates, the other layer describes the sequential execution of rules. The semantics has some nice...
متن کاملASM Semantics for C++ 2.0
The Abstract State Machines (ASMs) theory has been applied to formalize the semantics of the C♯ programming language in a rigorous mathematical manner. We have extended the C♯ ASM model in order to handle C♯ 2.0 specific features like generics, anonymous methods and iterator blocks. We discovered that the existing operational model (the dynamic semantics) can be reused entirely. It is not alter...
متن کامل